Selecting Efficient Features via a Hyper-Heuristic Approach

نویسندگان

  • Montazeri Mitra
  • Mahdieh Soleymani Baghshah
  • Aliakbar Niknafs
چکیده

By Emerging huge databases and the need to efficient learning algorithms on these datasets, new problems have appeared and some methods have been proposed to solve these problems by selecting efficient features. Feature selection is a problem of finding efficient features among all features in which the final feature set can improve accuracy and reduce complexity. One way to solve this problem is to evaluate all possible feature subsets. However, evaluating all possible feature subsets is an exhaustive search and thus it has high computational complexity. Until now many heuristic algorithms have been studied for solving this problem. Hyper-heuristic is a new heuristic approach which can search the solution space effectively by applying local searches appropriately. Each local search is a neighborhood searching algorithm. Since each region of the solution space can have its own characteristics, it should be chosen an appropriate local search and apply it to current solution. This task is tackled to a supervisor. The supervisor chooses a local search based on the functional history of local searches. By doing this task, it can trade of between exploitation and exploration. Since the existing heuristic cannot trade of between exploration and exploitation appropriately, the solution space has not been searched appropriately in these methods and thus they have low convergence rate. 1 ،نامرک ،رنهاب دیهش هاگشناد ،رتویپماک یسدنهم هورگ ،یعونصم شوه دشرا یسانشراک يوجشناد [email protected] * نامرک رنهاب دیهش هاگشناد ،ناوج نارگشهوژپ نمجنا وضع . 2 ،رایداتسا ،نامرک ،رنهاب دیهش هاگشناد ،رتویپماک یسدنهم هورگ [email protected] 3 ،رایداتسا ،نامرک ،رنهاب دیهش هاگشناد ،رتویپماک یسدنهم هورگ [email protected] For the first time, in this paper use a hyper-heuristic approach to find an efficient feature subset. In the proposed method, genetic algorithm is used as a supervisor and 16 heuristic algorithms are used as local searches. Empirical study of the proposed method on several commonly used data sets from UCI data sets indicates that it outperforms recent existing methods in the literature for feature selection.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two-tier Supplier Base Efficiency Evaluation Via Network DEA: A Game Theory Approach

In today's competitive markets, firms try to reduce their supply cost by selecting efficient suppliers using different techniques. Several methods can be applied to evaluate the efficiency of supplier base. This paper develops generalized network data envelopment analysis models to examine the efficiency of two-tier supplier bases under cooperative and non-cooperative strategies where each tier...

متن کامل

An Intelligent Hyper-Heuristic Framework for CHeSC 2011

The present study proposes a new selection hyper-heuristic providing several adaptive features to cope with the requirements of managing different heuristic sets. The approach suggested provides an intelligent way of selecting heuristics, determines effective heuristic pairs and adapts the parameters of certain heuristics online. In addition, an adaptive list-based threshold accepting mechanism...

متن کامل

Hyper-Heuristic Algorithm for Finding Efficient Features in Diagnose of Lung Cancer Disease

Background: Lung cancer was known as primary cancers and the survival rate of cancer is about 15%. Early detection of lung cancer is the leading factor in survival rate. All symptoms (features) of lung cancer do not appear until the cancer spreads to other areas. It needs an accurate early detection of lung cancer, for increasing the survival rate. For accurate detection, it need characterizes ...

متن کامل

A Heuristic Algorithm for Nonlinear Lexicography Goal Programming with an Efficient Initial Solution

In this paper,  a heuristic algorithm is proposed in order to solve a nonlinear lexicography goal programming (NLGP) by using an efficient initial point. Some numerical experiments showed that the search quality by the proposed heuristic in a multiple objectives problem depends on the initial point features, so in the proposed approach the initial point is retrieved by Data Envelopment Analysis...

متن کامل

Hyper-heuristics: Raising the Level of Generality

Hyper-heuristics are easy-to-implement emerging search and optimisation strategies which have been used instead of meta-heuristics for providing higher level generalized structures to solve mainly combinatorial optimisation problems. The motivation behind them is generally expressed as raising the level of generality. That is, they are the answers to the following question: How can we create or...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1601.05409  شماره 

صفحات  -

تاریخ انتشار 2016